Fifth Internation Conference on Computability and Complexity in Analysis August 21-24, 2008, Hagen, Germany provisional programme

Source URL: cca-net.de

• Computability theory
• Computable function
• Computable analysis
• Recursively enumerable set
• Oracle machine
• Computability
• High
• Reduction
• Mathematical logic

Sample Complexity of Composite Likelihood Joseph K. Bradley Carlos Guestrin Carnegie Mellon University

Source URL: select.cs.cmu.edu

• Statistics
• Estimation theory
• Statistical theory
• Maximum likelihood estimation
• Efficient estimator
• Estimator
• Likelihood function
• Normal distribution
• Loss function
• Consistent estimator

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

The Biotic Pattern of Prime Numbers Supports the Bios Theory of Creative Evolution from Radiation to Complexity H. Sabelli, Chicago Center for Creative Development. Chicago, IL 60614

Source URL: necsi.edu

• Analytic number theory
• Prime number
• Recurrence plot
• Time series
• Chaos theory
• Riemann zeta function

Application Note: Scalable HashingProblem How can you use Judy to create a scalable hash table with outstanding performance and automatic scaling, while avoiding the complexity of dynamic hashing?

Source URL: judy.sourceforge.net

• Search algorithms
• Information science
• Information retrieval
• Hashing
• Computer programming
• Hash table
• Hash function
• Trie
• Judy array
• Hash
• Cuckoo hashing
• 2-choice hashing

On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas †

Source URL: www.cas.mcmaster.ca

• Circuit complexity
• Pseudorandomness
• Order theory
• Computational complexity theory
• Monotonic function
• Pseudorandom generator
• Parity function
• Monotone
• ACC0

Computational complexity of logical theories of one successor and another unary function Pascal MICHEL∗ ´ Equipe de logique de l’universit´e Paris 7

Source URL: www.logique.jussieu.fr

Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits Yasin Abbasi-Yadkori Dept. of Computing Science University of Alberta

Source URL: webdocs.cs.ualberta.ca

• Econometrics
• Machine learning
• Statistical theory
• Probability distributions
• Online machine learning
• Loss function
• Big O notation
• Sample complexity
• Confidence interval
• Normal distribution
• Matrix
• Algorithm

A Note on the Space Complexity of Fast D-Finite Function Evaluation Marc Mezzarobba1 Inria, AriC, LIP (UMR 5668 CNRS-ENS Lyon-Inria-UCBL)

Source URL: www.marc.mezzarobba.net

THE AUTOMORPHISM GROUP OF A SHIFT OF LINEAR GROWTH: BEYOND TRANSITIVITY VAN CYR AND BRYNA KRA Abstract. For a finite alphabet A and shift X ⊆ AZ whose factor complexity function grows at most linearly, we study the alg

Source URL: www.math.northwestern.edu